A Novel Algorithm Based on 2D Packing Algorithm BFD for Timeslots Assignment in MF-TDMA System
نویسندگان
چکیده
This paper presents a periodic heuristic algorithm to solve the timeslots assignment problem of multi-terminals in MF-TDMA system with star topology. The goal is to design an algorithm that allows the processing of a given traffic profile with some constraints and a maximum utilization of the total frequency channel capacity, using the minimum spectrum bandwidth. The MF-TDMA system is viewed as a collection of bins, and then the resource assignment problem for the uplink becomes combinatorialoptimization problem which can be seen as a two-dimensional (2D) dynamic bin-packing problem with additional constraints. In the paper, the RCP-fit and the Best-Fit-Decreasing algorithms are integrated as a basis, which is added some additional restrictions. Through the experiment and simulation compared with existing algorithm, the proposed heuristic algorithm can improve the utilization of limited timeslot resources.
منابع مشابه
A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks
This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer. The objective ...
متن کاملEFFICIENT RESOURCE ALLOCATION FOR QoS CHANNELS IN MF-TDMA SATELLITE SYSTEMS
In this paper, we address the problem of providing guaranteed quality of service (QoS) channels over multifrequency time division multiple access (MF-TDMA) systems that employ DPSK with multiple modulation modes. The two QoS measures that we consider are the bit error rate (BER) and the data rate. We treat the data rate as a deterministic QoS measure, and the BER as a statistical QoS measure. O...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملOptimization of Fabric Layout by Using Imperialist Competitive Algorithm
In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015